/*
 * 0056. 两数之和
 * 给一个整数数组，找到两个数使得他们的和等于一个给定的数 target。
 * 你需要实现的函数twoSum需要返回这两个数的下标, 并且第一个下标小于第二个下标。注意这里下标的范围是 0 到 n-1。
 * https://www.lintcode.com/problem/two-sum/description
 * 
 * 样例
 * 给出 numbers = [2, 7, 11, 15], target = 9, 返回 [0, 1].
 * 
 * 挑战
 * Either of the following solutions are acceptable:
 * 
 * O(n) Space, O(nlogn) Time
 * O(n) Space, O(n) Time
 * 
 * 2018.07.12 @jeyming
 */
package two_sum_0056;

public class Two_sum_0056 {
    /**
     * @param numbers: An array of Integer
     * @param target: target = numbers[index1] + numbers[index2]
     * @return: [index1, index2] (index1 < index2)
     */
    public int[] twoSum(int[] numbers, int target) {
        // write your code here
    	int[] twoSumRes = new int[2];
    	for(int i = 0; i < numbers.length - 1; ++i) {
    		for(int j = i + 1; j < numbers.length; ++j) {
    			if(numbers[i] + numbers[j] == target) {
    				twoSumRes[0] = i;
    				twoSumRes[1] = j;
    				return twoSumRes;
    			}
    		}
    	}
    	return twoSumRes;
    }

	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}
